Unavoidable Set: Extension and Reduction
نویسندگان
چکیده
منابع مشابه
An Unavoidable Set of D-Reducible Configurations
We give a new proof of the four-color theorem by exhibiting an unavoidable set of 2822 D-reducible configurations. The existence of such a set had been conjectured by several researchers including Stromquist [18], Appel and Haken [2] and Robertson, Sanders, Seymour and Thomas [15].
متن کاملExtension Error Set Based on Extension Set
This paper gives the concepts of extension error set and fuzzy extension error set, discusses diverse extension error set and fuzzy extension error set based on extension set and error set, and puts forward the relevant propositions and operations. Finally, it provides proofs of the soundness and completeness for the propositions and operations.
متن کاملExtension Data Mining Based on Extension Set and Rough Set
Data mining has gained popularity in the database field recently, the gained knowledge is static because of the static nature of the database, and does not reflect the dynamic nature of knowledge. Extension data mining is a product combining Extenics with data mining, By using the theory and method of Extenics, it can mine the knowledge from database which is relative to solve contradictory pro...
متن کاملUnavoidable and Almost Unavoidable Sets of Words
A set of words over a finite alphabet is called an unavoidable set if every word of sufficiently long length must contain some word from this set as a subword. Motivated by a theorem from automata theory, we introduce the notion of an almost unavoidable set and prove certain asymptotic estimates for the size of almost unavoidable sets of uniform length.
متن کاملUnavoidable set of face types for planar maps
The type of a face f of a planar map is a sequence of degrees of vertices of f as they are encountered when traversing the boundary of f . A set T of face types is found such that in any normal planar map there is a face with type from T . The set T has four infinite series of types as, in a certain sense, the minimum possible number. An analogous result is applied to obtain new upper bounds fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1999
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:1999114